The complexity of primal logic with disjunction
نویسندگان
چکیده
We investigate the complexity of primal logic with disjunction according to the Kripke semantics as defined in [1] and the quasi-boolean semantics as defined in [2]. We show that the validity problem is coNP-complete, even for variable-free sequents. For quasi-boolean semantics, the satisfiability problem is shown to be NPcomplete (even for variable-free sequents), whereas for Kripke semantics it is shown to be coNP-complete for variable-free sequents and Σp2-complete in the general case. The evaluation problem is in P for quasi-boolean semantics, but coNP-complete for Kripke semantics.
منابع مشابه
Primal Implication as Encryption
We propose a “cryptographic” interpretation for the propositional connectives of primal infon logic introduced by Y. Gurevich and I. Neeman and prove the corresponding soundness and completeness results. Primal implication φ→p ψ corresponds to the encryption of ψ with a secret key φ, primal disjunction φ ∨p ψ is a group key and ⊥ reflects some backdoor constructions such as full superuser permi...
متن کاملPropositional primal logic with disjunction
Gurevich and Neeman introduced Distributed Knowledge Authorization Language (DKAL). The world of DKAL consists of communicating principals computing their own knowledge in their own states. DKAL is based on a new logic of information, the so-called infon logic, and its efficient subsystem called primal logic. In this paper we simplify Kripkean semantics of primal logic and study various extensi...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملDisjunction in Modal Description Logics
We investigate the complexity of satisfaction problems in modal description logics without disjunction between formulae. It is shown that simulation of disjunction in the class of all models of these logics is possible, so that the complexity remains same no matter the logics is with or without disjunction of formulae. However, the omission of disjunction, in the class of the models based on th...
متن کاملComplexity Results for Modal Dependence Logic
Modal dependence logic was introduced recently by Väänänen. It enhances the basic modal language by an operator =(). For propositional variables p1, . . . , pn, =(p1, . . . , pn−1, pn) intuitively states that the value of pn is determined by those of p1, . . . , pn−1. Sevenster (J. Logic and Computation, 2009) showed that satisfiability for modal dependence logic is complete for nondeterministi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 115 شماره
صفحات -
تاریخ انتشار 2015